Metatheory of actions: Beyond consistency

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metatheory of actions: beyond consistency

Consistency check has been the only criterion for theory evaluation in logic-based approaches to reasoning about actions. This work goes beyond that and contributes to the metatheory of actions by investigating what other properties a good domain description in reasoning about actions should have. We state some metatheoretical postulates concerning this sore spot. When all postulates are satisf...

متن کامل

Modular Metatheory for Memory Consistency Models

We present a framework based on operational semantics for formalizing shared-memory multithreaded programming languages with relaxed memory consistency models. The key feature of our framework is a division of each system’s semantics into two modules, the program semantics and the heap semantics. This modularization allows elegant, concise, and reusable components. It is trivial to use the same...

متن کامل

Consistency of Wilsonian effective actions

Wilsonian effective actions are interpreted as free energies in ensembles with prescribed field expectation values and prescribed connected two-point functions. Since such free energies are directly obtained from two-particle-irreducible functionals, it follows that Wilsonian effective actions satisfy elementary perturbative consistency conditions, and non-perturbative convexity conditions. In ...

متن کامل

Beyond Singleton Arc Consistency

Shaving algorithms, like singleton arc consistency (sac), are currently receiving much interest. They remove values which are not part of any solution. This paper proposes an efficient shaving algorithm for enforcing stronger forms of consistency than sac. The algorithm is based on the notion of weak k-singleton arc consistency, which is equal to sac if k = 1 but stronger if k > 1. This paper d...

متن کامل

Beyond Consistency and Substitutability

Elimination of inconsistent values in instances of the constraint satisfaction problem (CSP) conserves all solutions. Elimination of substitutable values conserves at least one solution. We show that certain values which are neither inconsistent nor substitutable can also be deleted while conserving at least one solution. This allows us to state novel rules for the elimination of values in a bi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2007

ISSN: 0004-3702

DOI: 10.1016/j.artint.2007.04.013